Clones containing all almost unary functions
نویسندگان
چکیده
منابع مشابه
Clones containing all almost unary functions
Let X be an infinite set of regular cardinality. We determine all clones on X which contain all almost unary functions. It turns out that independently of the size of X, these clones form a countably infinite descending chain. Moreover, all such clones are finitely generated over the unary functions. In particular, we obtain an explicit description of the only maximal clone in this part of the ...
متن کاملPartial Clones Containing all Boolean Monotone Self-dual Partial Functions
The study of partial clones on 2 := {0, 1} was initiated by R. V. Freivald. In his fundamental paper published in 1966, Freivald showed, among other things, that the set of all monotone partial functions and the set of all self-dual partial functions are both maximal partial clones on 2. Several papers dealing with intersections of maximal partial clones on 2 have appeared after Freivald work. ...
متن کاملAlmost All Functions Require Exponential Energy
One potential method to attain more energy-efficient circuits with the current technology is Near-Threshold Computing, which means using less energy per gate by designing the supply voltages to be closer to the threshold voltage of transistors. However, this energy savings comes at a cost of a greater probability of gate failure, which necessitates that the circuits must be more fault-tolerant,...
متن کاملUnary functions
We consider F , the class of nite unary functions, i.e. the class of pairs of the form (A; f) where A is a nite set and f is an unary function on A. We also consider two subclasses of F : B and Fk for k > 1. B contains structures (A; f) with the property that f is a bijection of the set A, and Fk contains structures (A; f) with the property that inverse image of every point in A under f has c...
متن کاملUnary Primitive Recursive Functions
In this article, we will study certain reductions in the schemes that conform unary primitive recursive functions (i.e. primitive recursive functions of one argument) and we will extend some results previously researched by R. M. Robinson in [15]. Furthermore, we will introduce formal notation for unary primitive recursive functions. §
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Algebra Universalis
سال: 2004
ISSN: 0002-5240,1420-8911
DOI: 10.1007/s00012-004-1860-6